The Curious Inference of Boolos in Mizar and OMEGA!
نویسندگان
چکیده
We examine Boolos’ curious inference and formalize it in a system based on set theory (Mizar) and a system based on classical higher-order logic (OMEGA). The Boolos example is interesting because while it can in principle be proven using a complete first-order calculus, it is impractical to do so. In our case study we are interested in aspects such as how natural and at what level of granularity Boolos’ short secondorder proof sketch can be formalized in Mizar and OMEGA.
منابع مشابه
STUDIES IN LOGIC , GRAMMAR AND RHETORIC 10 ( 23 ) 2007 The Curious Inference
We examine Boolos’ curious inference and formalize it in a system based on set theory (Mizar) and a system based on classical higherorder logic (OMEGA). The Boolos example is interesting because while it can in principle be proven using a complete first-order calculus, it is impractical to do so. In our case study we are interested in aspects such as how natural and at what level of granularity...
متن کاملMizar's Soft Type System
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expressions are typed but the values of those expressions are not. In this paper we present the Mizar type system as a collection of type inference rules. We will interpret Mizar types as soft types, by translating Mizar’s type...
متن کاملEscape to Mizar from ATPs
We announce a tool for mapping E derivations to Mizar proofs. Our mapping complements earlier work that generates problems for automated theorem provers from Mizar inference checking problems. We describe the tool, explain the mapping, and show how we solved some of the difficulties that arise in mapping proofs between different logical formalisms, even when they are based on the same notion of...
متن کاملA Mizar Mode for HOL
The HOL theorem prover is implemented in the LCF manner. All inference is ultimately reduced to a collection of very simple (forward) primitive inference rules, but by programming it is possible to build alternative means of proving theorems on top, while preserving security. Existing HOL proofs styles are, however, very different from those used in textbooks. Here we describe the addition of a...
متن کاملmizar-items: Exploring Fine-Grained Dependencies in the Mizar Mathematical Library
The MML is one of the largest collection of formalized mathematical knowledge that has been developed with various interactive proof assistants. It comprises more than 1100 “articles” summing to nearly 2.5 million lines of text, each consisting of a unified collection of mathematical definitions and proofs. Semantically, it contains more than 50000 theorems and more than 10000 definitions expre...
متن کامل